/*
 * @lc app=leetcode id=32 lang=cpp
 *
 * [32] Longest Valid Parentheses
 */
class Solution {
public:
    int longestValidParentheses(string s) {
        int len = s.length();
        if (len <= 1) {
            return 0;
        }

        int maxlen = 0;
        int lastLeft = -1;

        return maxlen;
    }
};

